Algorithmic Arguments in Physics of Computation
نویسندگان
چکیده
We show the usefulness of incompressibility arguments based on Kolmogorov complexity in physics of computation by several examples. These include analysis of energy parsimoniousàdiabatic' computation , and scalability of network architectures.
منابع مشابه
The Principle of Relativity: From Ungar’s Gyrolanguage for Physics to Weaving Computation in Mathematics
This paper extends the scope of algebraic computation based on a non standard $times$ to the more basic case of a non standard $+$, where standard means associative and commutative. Two physically meaningful examples of a non standard $+$ are provided by the observation of motion in Special Relativity, from either outside (3D) or inside (2D or more), We revisit the ``gyro''-theory ...
متن کاملWhy Kolmogorov Complexity in Physical Equations?
Several researchers, including M. Gell-Mann, argue that the notion of Kolmogorov complexity, developed in the algorithmic information theory, is useful in physics (i.e., in the description of the physical world). Their arguments are rather convincing, but there seems to be a gap between traditional physical equations and Kolmogorov complexity: namely, it is not clear how the standard equations ...
متن کاملIntroducing the Computable Universe
Some contemporary views of the universe assume information and computation to be key in understanding and explaining the basic structure underpinning physical reality. We introduce the Computable Universe exploring some of the basic arguments giving foundation to these visions. We will focus on the algorithmic and quantum aspects, and how these may fit and support the computable universe hypoth-
متن کاملAnalysis of Information and Computation in Physics Explains Cognitive Paradigms: from Full Cognition to Laplace Determinism to Statistical Determinism to Modern Approach
In this paper, we analyze the problem of prediction in physics from the computational viewpoint. We show that physical paradigms like Laplace determinism, statistical determinism, etc., can be naturally explained by this computational analysis. In our explanations, we use the notions of the Algorithmic Information Theory such as Kolmogorov complexity and algorithmic randomness, as well as the n...
متن کاملSystematic Analysis of HEP Collider Data
Compelling arguments suggest the presence of new physics at energy scales that will be probed by frontier energy colliders over the next decade. Arguments for each of the many flavors of new physics that have been proposed seem much less compelling. The wide variety of experimental signatures by which new physics may manifest itself suggests the desirability of analyzing all high energy collide...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995